Sequentiality and the CPS Semantics of Fresh Names
نویسنده
چکیده
We investigate the domain-theoretic denotational semantics of a CPS calculus with fresh name declaration. This is the target of a fully abstract CPS translation from the nu-calculus with first-class continuations. We describe a notion of “FM-categorical” model for our calculus, with a simple interpretation of name generation due to Shinwell and Pitts. We show that full abstraction fails (at order two) in the simplest instance of such a model (FM-cpos) because of the presence of parallel elements. Accordingly, we define a sequential model — FM-biorders, based on “bistable FM-bicpos” and bistable functions — and prove that it is fully abstract up to order four (our main result), but that full abstraction fails at order five.
منابع مشابه
Relating Two Semantics of Locally Scoped Names
The operational semantics of programming constructs involving locally scoped names typically makes use of stateful dynamic allocation: a set of currently-used names forms part of the state and upon entering a scope the set is augmented by a new name bound to the scoped identifier. More abstractly, one can see this as a transformation of local scopes by expanding them outward to an implicit top-...
متن کاملModeling Fresh Names in the π - calculus using Abstractions ? Roberto Bruni
In this paper, we model fresh names in the π-calculus using abstractions with respect to a new binding operator θ. Both the theory and the metatheory of the π-calculus benefit from this simple extension. The operational semantics of this new calculus is finitely branching. Bisimulation can be given without mentioning any constraint on names, thus allowing for a straightforward definition of a c...
متن کاملModeling Fresh Names in the ?-calculus Using Abstractions
In this paper, we model fresh names in the π-calculus using abstractions w.r.t. a new binding operator θ. Both the theory and the metatheory of the π-calculus benefit from this simple extension. The operational semantics of this new calculus is finitely branching. Bisimulation can be given without mentioning any constraint on names, thus allowing for a straightforward definition of a coalgebrai...
متن کاملFresh Logic: proof-theory and semantics for FM and nominal techniques
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the FM-sets model of names and binding in abstract syntax. Fresh Logic can be classical or intuitionistic depending on whether we include a law of excluded middle; we present a proof-normalisation procedure for the intuitionistic case and a semantics based ...
متن کاملOn a monadic semantics for freshness
A standard monad of continuations, when constructed with domains in the world ofFM-sets [1], is shown to provide a model of dynamic allocation of fresh names that isboth simple and useful. In particular, it is used to prove that the powerful facilitiesfor manipulating fresh names and binding operations provided by the “FreshML”series of metalanguages [2–4] respect α-equivalence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 173 شماره
صفحات -
تاریخ انتشار 2007